Entrez un mot ou une phrase dans n'importe quelle langue 👆
Langue:
Traduction et analyse des mots par intelligence artificielle
Sur cette page, vous pouvez obtenir une analyse détaillée d'un mot ou d'une phrase, réalisée à l'aide de la meilleure technologie d'intelligence artificielle à ce jour:
- comment le mot est utilisé
- fréquence d'utilisation
- il est utilisé plus souvent dans le discours oral ou écrit
- options de traduction de mots
- exemples d'utilisation (plusieurs phrases avec traduction)
- étymologie
Qu'est-ce (qui) est quasilinear problem - définition
WIKIMEDIA DISAMBIGUATION PAGE
Quasilinear (disambiguation); Quasi-linear
Quasilinear utility
FUNCTION LINEAR IN ONE ARGUMENT (GENERALLY THE NUMERAIRE), USED IN ECONOMICS AND CONSUMER THEORY
Quasilinear utility function; Quasilinear utilities
In economics and consumer theory, quasilinear utility functions are linear in one argument, generally the numeraire. Quasilinear preferences can be represented by the utility function u(x_1, x_2, \ldots, x_n) = x_1 + \theta (x_2, \ldots, x_n) where \theta is strictly concave.
Knapsack problem
![multiple constrained problem]] could consider both the weight and volume of the boxes. <br />(Solution: if any number of each box is available, then three yellow boxes and three grey boxes; if only the shown boxes are available, then all except for the green box.)](https://commons.wikimedia.org/wiki/Special:FilePath/Knapsack.svg?width=200 "multiple constrained problem]] could consider both the weight and volume of the boxes. <br />(Solution: if any number of each box is available, then three yellow boxes and three grey boxes; if only the shown boxes are available, then all except for the green box.)")
PROBLEM IN COMBINATORIAL OPTIMIZATION
0/1 knapsack problem; 0-1 knapsack problem; Unbounded knapsack problem; Unbounded Knapsack Problem; Binary knapsack problem; Napsack problem; Backpack problem; 0-1 Knapsack problem; Integer knapsack problem; Knapsack Problem; Algorithms for solving knapsack problems; Methods for solving knapsack problems; Approximation algorithms for the knapsack problem; Bounded knapsack problem; Multiple knapsack problem; Rucksack problem; Computational complexity of the knapsack problem
The knapsack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. It derives its name from the problem faced by someone who is constrained by a fixed-size knapsack and must fill it with the most valuable items.
0/1 knapsack problem
PROBLEM IN COMBINATORIAL OPTIMIZATION
0/1 knapsack problem; 0-1 knapsack problem; Unbounded knapsack problem; Unbounded Knapsack Problem; Binary knapsack problem; Napsack problem; Backpack problem; 0-1 Knapsack problem; Integer knapsack problem; Knapsack Problem; Algorithms for solving knapsack problems; Methods for solving knapsack problems; Approximation algorithms for the knapsack problem; Bounded knapsack problem; Multiple knapsack problem; Rucksack problem; Computational complexity of the knapsack problem
<application> The knapsack problem restricted so that the
number of each item is zero or one.
(1995-03-13)
Wikipédia
Quasilinear
Quasilinear may refer to:
- Quasilinear function, a function that is both quasiconvex and quasiconcave
- Quasilinear utility, an economic utility function linear in one argument
- In complexity theory and mathematics, O(n log n) or sometimes O(n (log n)k)
- Quasilinear equation, a type of differential equation where the coefficient(s) of the highest order derivative(s) of the unknown function do not depend on highest order derivative(s)
